Minimal Pairs of Convex Sets Which Share a Recession Cone

نویسندگان

چکیده

Robinson introduced a quotient space of pairs unbounded convex sets which share their recession cone. In this paper minimal sets, i.e., representations elements Robinson's spaces, are investigated. The fact that pair having property translation is reduced proved. the case two-dimensional formula for finding an equivalent given, criterion minimality presented, reducibility all proved, and nontrivial examples shown. Shephard--Weil--Schneider's polytopal summand compact set generalized to sets. Finally, applied Hartman's representation differences functions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasidifferentiable Calculus and Minimal Pairs of Compact Convex Sets

The quasidifferential calculus developed by V.F. Demyanov and A.M. Rubinov provides a complete analogon to the classical calculus of differentiation for a wide class of nonsmooth functions. Although this looks at the first glance as a generalized subgradient calculus for pairs of subdifferentials it turns out that, after a more detailed analysis, the quasidifferential calculus is a kind of Fréc...

متن کامل

Cone of recession and unboundedness of convex functions

We consider the problem of determining whether or not a convex function f(x) is bounded below over R. Our focus is on investigating the properties of the vectors in the cone of recession 0f of f(x) which are related to the unboundedness of the function.

متن کامل

Lifts of Convex Sets and Cone Factorizations

In this paper we address the basic geometric question of when a given convex set is the image under a linear map of an affine slice of a given closed convex cone. Such a representation or “lift” of the convex set is especially useful if the cone admits an efficient algorithm for linear optimization over its affine slices. We show that the existence of a lift of a convex set to a cone is equival...

متن کامل

Efficiently computing minimal sets of critical pairs

In the computation of a Gröbner basis using Buchberger’s algorithm, a key issue for improving the efficiency is to produce techniques for avoiding as many unnecessary critical pairs as possible. A good solution would be to avoid all non-minimal critical pairs, and hence to process only a minimal set of generators of the module generated by the critical syzygies. In this paper we show how to obt...

متن کامل

Minimum recession-compatible subsets of closed convex sets

A subset B of a closed convex set A is recession-compatible with respect to A if A can be expressed as the Minkowski sum of B and the recession cone of A. We show that if A contains no line, then there exists a recession-compatible subset of A that is minimum with respect to set inclusion. The proof only uses basic facts of convex analysis and does not depend on Zorn’s Lemma. An application of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Siam Journal on Optimization

سال: 2022

ISSN: ['1095-7189', '1052-6234']

DOI: https://doi.org/10.1137/21m1410695